Slotted-Circus : A Generic UTP framework for discretely-timed Circus
نویسنده
چکیده
3 Slotted-Circus (Formal Definition) 10 3.1 Observational Variables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.2 Required Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.2.1 Accepted and Refused Events and Equivalent Traces . . . . . . . . . . . . . 11 3.2.2 Null Slots . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2.3 Slot Prefix Relation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2.4 Slot Addition (Concatenation) . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.5 Slot Subtraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.6 Relating Addition and Subtraction . . . . . . . . . . . . . . . . . . . . . . . 14 3.2.7 Hiding Slot Events . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2.8 Slot Synchronisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2.9 Parameter Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.3 Derived Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.3.1 Trace Equivalence of a Slot-Sequence . . . . . . . . . . . . . . . . . . . . . . 18 3.3.2 Extracting Refusal Sequences . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.3.3 Slot-Sequence Prefix Ordering (4) . . . . . . . . . . . . . . . . . . . . . . . 19 3.3.4 Slot Equivalences . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.3.5 Slot-Sequence Addition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.3.6 Slot-Sequence Subtraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.3.7 Relating Slot-Sequence Addition and Subtraction . . . . . . . . . . . . . . . 22 3.4 Healthiness Conditions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 3.4.1 Reactive Healthiness 1 (R1) . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
منابع مشابه
The Denotational Semantics of slotted-Circus
This paper describes a complete denotational semantics, in the UTP framework, of slotted-Circus, a generic framework for reasoning about discrete timed/synchronously clocked systems. The key result presented here is a comprehensive semantics of the entire language that addresses various semantics issues that have been uncovered, whilst laying foundations for future extensions, particularly towa...
متن کاملSlotted - Circus A UTP - Family of Reactive Theories
We present a generic framework of UTP theories for describing systems whose behaviour is characterised by regular time-slots, compatible with the general structure of the Circus language [WC01a]. This “slotted-Circus” framework is parameterised by the particular way in which event histories are observable within a time-slot, and specifies what laws a desired parameterisation must obey in order ...
متن کاملTowards Algebraic Semantics of Circus Time
Over the years, the Circus family of notation has been used for specification, programming, and verification by refinement in many applications. Circus Time, a timed variant of Circus, plays a key role in dealing with timed behaviours. While most of the semantic developments of Circus Time have tended to focus on the denotational and operational sides, the work on its algebraic semantics is fru...
متن کاملA Framework for Specification and Validation of Real-Time Systems Using Circus Actions
Circus is a specification and programming language that combines CSP, Z, and refinementcalculus constructs. The semantics of Circus is defined using the Unifying Theories ofProgramming (UTP). In this work we extend a subset of Circus with time operators.The new language is denominated Circus Time Action. We propose a new time modelthat extends the Unifying Theories of Programmin...
متن کاملIsabelle/Circus: A Process Specification and Verification Environment
The Circus specification language combines elements for complex data and behavior specifications, using an integration of Z and CSP with a refinement calculus. Its semantics is based on Hoare and He’s unifying theories of programming (UTP). We develop a machine-checked, formal semantics based on a “shallow embedding” of Circus in Isabelle/UTP (our semantic theory of UTP based on Isabelle/HOL). ...
متن کامل